Algorithmic Chaos

نویسنده

  • Paul M. B. Vitányi
چکیده

Many physical theories like chaos theory are fundamentally concerned with the conceptual tension between determinism and randomness. Kolmogorov complexity can express randomness in determinism and gives an approach to formulate chaotic behavior.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chaos, Dynamics and Fractals: An Algorithmic Approach to Deterministic Chaos (J. L. McCauley)

Thank you for downloading chaos dynamics and fractals an algorithmic approach to deterministic chaos. Maybe you have knowledge that, people have look hundreds times for their chosen books like this chaos dynamics and fractals an algorithmic approach to deterministic chaos, but end up in infectious downloads. Rather than enjoying a good book with a cup of tea in the afternoon, instead they juggl...

متن کامل

An algorithmic view of pseudochaos

The controversial concept of quantum chaos – the dynamical chaos in bounded mesoscopic quantum systems – is presented as the most important and universal instance of a new generic dynamical phenomenon: pseudochaos. The latter characterizes the irregular behaviour of dynamical systems with discrete energy and/or frequency spectrum, which include classical systems with discrete phase space. The q...

متن کامل

Computability and information in models of randomness and chaos

This paper presents a short survey of some recent approaches relating different areas: deterministic chaos and computability. Chaos, in classical physics, may be approached by dynamical (equationally determined) systems or stochastic ones (as random processes). Now, randomness has also been effectively modeled with recursion theoretic tools by P. Martin-Löf. We recall its connections to Kolmogo...

متن کامل

Recurrence and algorithmic information

In this paper we initiate a somewhat detailed investigation of the relationships between quantitative recurrence indicators and algorithmic complexity of orbits in weakly chaotic dynamical systems. We mainly focus on examples.

متن کامل

Gradient dynamic optimization with Legendre chaos

The polynomial chaos approach for stochastic simulation is applied to trajectory optimization, by conceptually replacing random variables with free variables. Using the gradient method, we generate with low computational cost an accurate parametrization of optimal trajectories.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره nlin.CD/0303016  شماره 

صفحات  -

تاریخ انتشار 2003